On the Average Course Length in Mobility Models for Mobile Ad Hoc Networks
نویسندگان
چکیده
In simulations of Manets, mobile nodes usually move in a random direction until they reach their target, then stop and start heading to another direction. We propose in this paper to study the average course length of mobile nodes, from the moment they start moving to their respective destinations, and the time they stop. Since the knowledge of the time nodes keep on heading to their targets helps adjusting the refreshing period of ad hoc routing and topology control protocols, it becomes possible to obtain an insight of the expected improvements these protocols can get from the use of aperiodic instead of periodical updates. We show in this paper that when using fair metrics, the length of nodes movements following a Random-Waypoint mobility model (RWM) or a Manhattan mobility model (ManM) is situated around 10 seconds in the worst case scenario. Therefore, by fixing a refreshing period to this time interval, it becomes possible to improve the global performance of topology control and routing protocols. Index Terms Mobile Ad Hoc Networks, Course Length, Trajectory, Aperiodic Update, Predictability, Prediction-based, Dead-Reckoning.
منابع مشابه
Creating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملCreating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملImproving Quality of Service Routing in Mobile Ad Hoc Networks Using OLSR
Mobile ad hoc networks (MANET) are constructed by mobile nodes without access point. Since MANET has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. The OLSR protocol is an optimization of the classical link state algorithm. OLSR introduces an interesting concept, the multipoint r...
متن کاملA Fuzzy Realistic Mobility Model for Ad hoc Networks
Realistic mobility models can demonstrate more precise evaluation results because their parameters are closer to the reality. In this paper a realistic Fuzzy Mobility Model has been proposed. This model has rules which are changeable depending on nodes and environmental conditions. It seems that this model is more complete than other mobility models.After simulation, it was found out that not o...
متن کاملDesign and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks
Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...
متن کاملDesign and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks
Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...
متن کامل